pdlQueue

Section: OATH Reference Manual (3O)
Updated: 26 August 1991
Index Return to Main Contents

NAME

pdlQueue (pdlQueueA, pdlQueueG) - a push-down list implementation of lifoQueue

SYNOPSIS

#include <oath/pdlQueue.h>

DESCRIPTION

The pdlQueue is an implementation type of lifoQueue that will hold any obj (i.e. it is not a filtering bag). The pdlQueue is implemented as a singly-linked, push-down list. pdlPos is a companion class of pdlQueue that is an implementation type of pos for representing a position in a pdlQueue.

DERIVATION

pdlQueue : lifoQueue : seq : queue : bag : obj

pdlQueue is an implementation type.

STATIC OPERATIONS

pdlQueueA pdlQueueA:: isa (objA): pdlQueueA::isa(O) returns O if it is truly a pdlQueue; otherwise it returns Nil.
pdlQueueA pdlQueueA:: make (int = FALSE): pdlQueueA::make() makes and returns an empty pdlQueue. If the last argument is TRUE, then the new pdlQueue is const.
pdlQueueA pdlQueueA:: make (seqA, int = FALSE): pdlQueueA::make(S) makes and returns a pdlQueue that contains the same objs in the same order as seq S. If the last argument is TRUE, then the new pdlQueue is const.
pdlQueueA pdlQueueA:: make (posA, posA, int = FALSE): pdlQueueA::make(Start, Beyond) makes and returns a pdlQueue that contains the same objs in the same order as those between Start and Beyond. If the last argument is TRUE, then the new pdlQueue is const.

MEMBER OPERATIONS

pdlPosA pdlQueueA:: makePos (int = 0, int = FALSE): L.makePos(I) makes and returns a pdlPos that indicates the I'th position in pdlQueue L (I=0 is the first position). If the last argument is TRUE, then the new pdlPos is const.

INTERNAL OPERATIONS

AUTHOR

Brian M. Kennedy (Computer Science Center, Texas Instruments Incorporated)

BUGS

This document was created by man2html, using the manual pages.
Time: 00:37:22 GMT, March 30, 2022